Determination of 3-Ary α-Resolution in Lattice-valued Propositional Logic LP(X)

نویسندگان

  • Yi Liu
  • Hairui Jia
  • Yang Xu
چکیده

One of key issues for α-n(t) ary resolution automated reasoning based on lattice-valued logic with truthvalue in a lattice implication algebra is to investigate the α-n(t) ary resolution of some generalized literals. In this article, the determination of α-resolution of any 3-ary generalized literals which include the implication operators not more than 2 in LP(X). It not only lay the foundation for practical implementation of automated reasoning algorithm in LP(X), but also provides the strong support for α-n(t) ary resolution automated reasoning approaches.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-ary Α-semantic Resolution Automated Reasoning Based on a Lattice-valued Proposition Logic Lp(x)

This paper focuses on multi-ary α-semantic resolution automated reasoning method based on multi-ary α-resolution principle for lattice-valued propositional logic LP(X) with truth-value in lattice implication algebras. The definitions of the multi-ary α-semantic resolution and multi-ary α-semantic resolution deduction in lattice-valued propositional logic LP(X) are given, respectively, and the s...

متن کامل

Determination of α -Resolution for Lattice-Valued First-Order Logic Based on Lattice Implication Algebra

As a continuation of our research work on resolutionbased automated reasoning approaches for latticevalued logic systems with truth-values in a latticevalued logical algebraic structure – lattice implication algebra (LIA), in the present paper, we prove thatα resolution for lattice-valued first-order logic ( ) LF X based on LIA can be equivalently transformed into that for lattice-valued propos...

متن کامل

α-Quasi-Lock Semantic Resolution Method Based on Lattice-Valued Logic

Based on the general form of -resolution principle for a lattice-valued logic with truth-values defined in a latticevalued logical algebra structure lattice implication algebra, the further extended -resolution method in this lattice-valued logic is discussed in the present paper in order to increase the efficiency of the resolution method. Firstly, -quasi-lock semantic resolution method in lat...

متن کامل

α-Resolution Method for Lattice-valued Horn Generalized Clauses in Lattice-valued Propositional Logic Systems

In this paper, an α-resolution method for a set of lattice-valued Horn generalized clauses is established in lattice-valued propositional logic systemL P(X) based on lattice implication algebra. Firstly, the notions of lattice-valued Horn generalized clause, normal lattice-valued Horn generalized clause and unit latticevalued Horn generalized clause are given in L P(X). Then, the α-resolution o...

متن کامل

Truth Values and Connectives in Some Non-Classical Logics

The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Int. J. Computational Intelligence Systems

دوره 6  شماره 

صفحات  -

تاریخ انتشار 2013